潜艇上浮运动数值计算方法的研究与验证

预报潜艇上浮运动是探索研究潜艇上浮运动控制规律以及潜艇安全上浮的前提。就潜艇上浮运动的数值计算方法和计算流程进行了详细介绍,对数值计算方法中的湍流模型及离散格式等进行了优选。基于模型上浮试验结果,对数值计算的不确定度进行了分析且对数值计算结果进行了验证。证明了该数值计算的可靠性,并发现数值计算结果与试验结果很接近,验证了该数值计算方法的可行性,说明该数值计算方法和试验可为潜艇上浮运动的研究提供参考和借鉴。     

用线性规划法设计复系数FIR滤波器

讨论了在复Chebyshev逼近意义下设计复系数FIR滤波器问题。直接把复Chebyshev逼近问题离散化成有限维线性规划问题 ,再用单纯形法求解这种方法一直被认为只能设计实系数滤波器 ,而且计算量大、收敛速度慢。本文从直接离散化出发 ,推导出一种求解此问题的改进的单纯形算法 ,适用于设计复系数滤波器 ,极大地减小了计算量 ,提高了收敛速度。并证明了它与通过求解半无限线性规划的对偶问题而得到的改进的单纯形法是等价的。最后给出了算法的仿真结果     

一类不确定大系统的分散变结构模型跟随控制

针对一类具有不确定参数和外界扰动的非线性大系统 ,在子系统互连项上界具有多项式形式的条件下 ,提出了一种分散变结构模型跟随控制器设计方案。该控制器不需要未知参数变化、外界扰动以及子系统互连上界的先验信息 ,能够通过自适应率对上述信息进行在线估计。在保证闭环大系统渐近稳定的条件下 ,同时实现了各个子系统滑动模态的存在性和可达性。理论分析和仿真结果验证了本文所提方案的有效性     

含非线性介质Fabry-Perot腔混沌研究

根据混沌动力学的基本理论 ,计算了含非线性介质Fabry Perot腔动力学方程在其参数下的Lya punov指数分布图。利用Lyapunov指数和动力学特性的对应关系 ,分析出非线性Fabry Perot腔在各种参数下的动力学特性、稳态参数区域面积和混沌转换机制     

燃气轮机仿真软件构造方法综述

从方法论的角度综述了燃气轮机仿真软件的研究现状,分析了过程式方法和过程式模块化方法的不足,阐明采用面向对象方法的必要性,并对未来的发展方向作了初步探讨.     

略评“语言谬误”──评介楚明锟主编的《逻辑学》

２０世纪５０年代以来,西方在非形式逻辑方面取得了重大进展。近几年来,我国逻辑界对此有愈来愈多的认识与响应。２０００年末出版的《逻辑学》教科书可视为一个例证。该书的价值和水平值得肯定。但其中的“语言谬误”一节大可商榷。     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006